Cluster Editing: Kernelization Based on Edge Cuts
نویسندگان
چکیده
منابع مشابه
A More Effective Linear Kernelization for Cluster Editing
In the NP-hardCluster Editing problem, we have as input an undirected graph G and an integer k ≥ 0. The question is whether we can transform G, by inserting and deleting at most k edges, into a cluster graph, that is, a union of disjoint cliques. We first confirm a conjecture by Michael Fellows [IWPEC 2006] that there is a polynomialtime kernelization for Cluster Editing that leads to a problem...
متن کاملKernelization and Parameterized Complexity of Star Editing and Union Editing
The NP-hard Star Editing problem has as input a graph G = (V, E) with edges colored red and black and two positive integers k1 and k2, and determines whether one can recolor at most k1 black edges to red and at most k2 red edges to black, such that the resulting graph has an induced subgraph whose edge set is exactly the set of black edges. A generalization of Star Editing is Union Editing, whi...
متن کاملEdge-cuts in Graphs
In an earlier paper [3], we studied cycles in graphs that intersect all edge-cuts of prescribed sizes. Passing to a more general setting, we examine the existence of T -joins in grafts that intersect all edge-cuts whose size is in a given set A ⊆ {1, 2, 3}. In particular, we characterize all the contractionminimal grafts admitting no T -joins that intersect all edge-cuts of size 1 and 2. We als...
متن کاملEditing Graphs Into Few Cliques: Complexity, Approximation, and Kernelization Schemes
Given an undirected graph G and a positive integer k, the NP-hard Sparse Split Graph Editing problem asks to transform G into a graph that consists of a clique plus isolated vertices by performing at most k edge insertions and deletions; similarly, the P3-Bag Editing problem asks to transform G into a graph which is the union of two possibly overlapping cliques. We give a simple linear-time 3-a...
متن کاملKernelization Through Tidying---A Case Study Based on s-Plex Cluster Vertex Deletion
We introduce the NP-hard graph-based data clustering problem s-Plex Cluster Vertex Deletion, where the task is to delete at most k vertices from a graph so that the connected components of the resulting graph are s-plexes. In an s-plex, every vertex has an edge to all but at most s − 1 other vertices; cliques are 1-plexes. We propose a new method for kernelizing a large class of vertex deletion...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2011
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s00453-011-9595-1